Adaptive-search tree-structured residual vector quantization
نویسندگان
چکیده
Full-search vector quantization (VQ) provides optimal results only with high memory and computational cost. We describe the computational and memory requirements of treestructured VQ, residual VQ (RVQ), and tree-structured RVQ. We present multiple-rate, adaptive-search implementations of these VQ structures, and simulation results with video sequences. Tree-structured RVQ provides up to 1.5 db PSNR quality improvements over RVQ, as well as significant perceptual improvement. These algorithms maintain many of the benefits of full-search VQ, while providing trade-offs between computational, storage, and performance requirements.
منابع مشابه
Variable-length constrained-storage tree-structured vector quantization
Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho (1990, 1991) allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established by Makhoul et al. (1985), Riskin et al. (1991), and by Mahesh et al. (see IEEE Trans. Inform. Theory, vol.41, p.917-30,...
متن کاملComplexity Trade-offs for Video Coding Using Tree-structured Vector Quantization
Residual vector quantization (RVQ), tree-structured RVQ (TRVQ), and full-search tree-structured RVQ (FSTRVQ) are presented as techniques which exploit the benefit of vector quantization (VQ), while maintaining manageable memory and computational complexity. RVQ provides linear growth in memory and computational complexity with basic codebook size, compared to the exponential growth of full sear...
متن کاملFine granularity scalable speech coding using embedded tree-structured vector quantization
This paper proposes an efficient codebook design for tree-structured vector quantization (TSVQ) that is embedded in nature. We modify two speech coding standards by replacing their original quantizers for line spectral frequencies (LSF’s) and/or Fourier magnitudes quantization with TSVQ-based quantizers. The modified coders are fine-granular bit-rate scalable with gradual change in quality for ...
متن کاملApproximate Nearest Neighbor Search by Residual Vector Quantization
A recently proposed product quantization method is efficient for large scale approximate nearest neighbor search, however, its performance on unstructured vectors is limited. This paper introduces residual vector quantization based approaches that are appropriate for unstructured vectors. Database vectors are quantized by residual vector quantizer. The reproductions are represented by short cod...
متن کاملA new trellis vector residual quantizer: applications to image coding
We present a new Trellis Coded Vector Residual Quantizer (TCVRQ) that combines trellis coding and vector residual quantization. We propose new methods for computing quantization levels and experimentally analyze the performances of our TCVRQ in the case of still image coding. Experimental comparisons show that our quantizer performs better than the standard Tree and Exhaustive Search Quantizers...
متن کامل